0.13/0.14	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.37	% Computer   : n006.cluster.edu
0.13/0.37	% Model      : x86_64 x86_64
0.13/0.37	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.37	% Memory     : 8042.1875MB
0.13/0.37	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.37	% CPULimit   : 1200
0.13/0.37	% WCLimit    : 120
0.13/0.37	% DateTime   : Tue Jul 13 10:26:10 EDT 2021
0.13/0.37	% CPUTime    : 
0.21/0.37	% Number of cores: 8
0.21/0.37	% Python version: Python 3.6.8
0.21/0.37	# Version: 2.6rc1-ho
0.21/0.37	# No SInE strategy applied
0.21/0.37	# Trying AutoSched0 for 59 seconds
0.21/0.46	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4Y
0.21/0.46	# and selection function SelectMaxLComplexAPPNTNp.
0.21/0.46	#
0.21/0.46	# Preprocessing time       : 0.028 s
0.21/0.46	# Presaturation interreduction done
0.21/0.46	
0.21/0.46	# Proof found!
0.21/0.46	# SZS status Theorem
0.21/0.46	# SZS output start CNFRefutation
0.21/0.46	thf(satz50, axiom, ![X1:frac, X2:frac, X3:frac]:((lessf @ X1 @ X3<=lessf @ X2 @ X3)<=lessf @ X1 @ X2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz50)).
0.21/0.46	thf(satz42, axiom, ![X1:frac, X2:frac]:(lessf @ X2 @ X1<=moref @ X1 @ X2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz42)).
0.21/0.46	thf(satz44, axiom, ![X1:frac, X2:frac, X3:frac, X4:frac]:(moref @ X1 @ X2=>((eq @ X2 @ X4=>moref @ X3 @ X4)<=eq @ X1 @ X3)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz44)).
0.21/0.46	thf(satz61, axiom, ![X1:frac, X2:frac, X3:frac]:(moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X3)<=moref @ X1 @ X2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz61)).
0.21/0.46	thf(satz58, axiom, ![X1:frac, X2:frac]:eq @ (pf @ X1 @ X2) @ (pf @ X2 @ X1), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz58)).
0.21/0.46	thf(satz43, axiom, ![X1:frac, X2:frac]:(lessf @ X1 @ X2=>moref @ X2 @ X1), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz43)).
0.21/0.46	thf(satz64, conjecture, moref @ (pf @ x @ z) @ (pf @ y @ u), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz64)).
0.21/0.46	thf(m, axiom, moref @ x @ y, file('/export/starexec/sandbox/benchmark/theBenchmark.p', m)).
0.21/0.46	thf(n, axiom, moref @ z @ u, file('/export/starexec/sandbox/benchmark/theBenchmark.p', n)).
0.21/0.46	thf(c_0_9, plain, ![X1:frac, X2:frac, X3:frac]:(lessf @ X1 @ X2=>(lessf @ X2 @ X3=>lessf @ X1 @ X3)), inference(fof_simplification,[status(thm)],[satz50])).
0.21/0.46	thf(c_0_10, plain, ![X1:frac, X2:frac]:(moref @ X1 @ X2=>lessf @ X2 @ X1), inference(fof_simplification,[status(thm)],[satz42])).
0.21/0.46	thf(c_0_11, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(moref @ X1 @ X2=>(eq @ X1 @ X3=>(eq @ X2 @ X4=>moref @ X3 @ X4))), inference(fof_simplification,[status(thm)],[satz44])).
0.21/0.46	thf(c_0_12, plain, ![X30:frac, X31:frac, X32:frac]:(~lessf @ X30 @ X31|(~lessf @ X31 @ X32|lessf @ X30 @ X32)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])).
0.21/0.46	thf(c_0_13, plain, ![X35:frac, X36:frac]:(~moref @ X35 @ X36|lessf @ X36 @ X35), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])).
0.21/0.46	thf(c_0_14, plain, ![X1:frac, X2:frac, X3:frac]:(moref @ X1 @ X2=>moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X3)), inference(fof_simplification,[status(thm)],[satz61])).
0.21/0.46	thf(c_0_15, plain, ![X21:frac, X22:frac, X23:frac, X24:frac]:(~moref @ X21 @ X22|(~eq @ X21 @ X23|(~eq @ X22 @ X24|moref @ X23 @ X24))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])).
0.21/0.46	thf(c_0_16, plain, ![X33:frac, X34:frac]:eq @ (pf @ X33 @ X34) @ (pf @ X34 @ X33), inference(variable_rename,[status(thm)],[satz58])).
0.21/0.46	thf(c_0_17, plain, ![X1:frac, X2:frac, X3:frac]:(lessf @ X1 @ X3|~lessf @ X1 @ X2|~lessf @ X2 @ X3), inference(split_conjunct,[status(thm)],[c_0_12])).
0.21/0.46	thf(c_0_18, plain, ![X1:frac, X2:frac]:(lessf @ X2 @ X1|~moref @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_13])).
0.21/0.46	thf(c_0_19, plain, ![X27:frac, X28:frac, X29:frac]:(~moref @ X27 @ X28|moref @ (pf @ X27 @ X29) @ (pf @ X28 @ X29)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])).
0.21/0.46	thf(c_0_20, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(moref @ X3 @ X4|~moref @ X1 @ X2|~eq @ X1 @ X3|~eq @ X2 @ X4), inference(split_conjunct,[status(thm)],[c_0_15])).
0.21/0.46	thf(c_0_21, plain, ![X2:frac, X1:frac]:eq @ (pf @ X1 @ X2) @ (pf @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_16])).
0.21/0.46	thf(c_0_22, plain, ![X1:frac, X2:frac, X3:frac]:(lessf @ X1 @ X2|~lessf @ X1 @ X3|~moref @ X2 @ X3), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.21/0.46	thf(c_0_23, plain, ![X1:frac, X3:frac, X2:frac]:(moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X3)|~moref @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_19])).
0.21/0.46	thf(c_0_24, plain, ![X2:frac, X4:frac, X3:frac, X1:frac]:(moref @ X1 @ (pf @ X2 @ X3)|~moref @ X4 @ (pf @ X3 @ X2)|~eq @ X4 @ X1), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.21/0.46	thf(c_0_25, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(lessf @ X1 @ (pf @ X2 @ X3)|~lessf @ X1 @ (pf @ X4 @ X3)|~moref @ X2 @ X4), inference(spm,[status(thm)],[c_0_22, c_0_23])).
0.21/0.46	thf(c_0_26, plain, ![X1:frac, X2:frac, X4:frac, X3:frac]:(moref @ X1 @ (pf @ X2 @ X3)|~eq @ (pf @ X4 @ X2) @ X1|~moref @ X4 @ X3), inference(spm,[status(thm)],[c_0_24, c_0_23])).
0.21/0.46	thf(c_0_27, plain, ![X25:frac, X26:frac]:(~lessf @ X25 @ X26|moref @ X26 @ X25), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz43])])).
0.21/0.46	thf(c_0_28, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(lessf @ X1 @ (pf @ X2 @ X3)|~moref @ (pf @ X4 @ X3) @ X1|~moref @ X2 @ X4), inference(spm,[status(thm)],[c_0_25, c_0_18])).
0.21/0.46	thf(c_0_29, plain, ![X1:frac, X2:frac, X3:frac]:(moref @ (pf @ X1 @ X2) @ (pf @ X1 @ X3)|~moref @ X2 @ X3), inference(spm,[status(thm)],[c_0_26, c_0_21])).
0.21/0.46	thf(c_0_30, negated_conjecture, ~moref @ (pf @ x @ z) @ (pf @ y @ u), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz64])])).
0.21/0.46	thf(c_0_31, plain, ![X1:frac, X2:frac]:(moref @ X2 @ X1|~lessf @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_27])).
0.21/0.46	thf(c_0_32, plain, ![X1:frac, X3:frac, X4:frac, X2:frac]:(lessf @ (pf @ X1 @ X2) @ (pf @ X3 @ X4)|~moref @ X3 @ X1|~moref @ X4 @ X2), inference(spm,[status(thm)],[c_0_28, c_0_29])).
0.21/0.46	thf(c_0_33, negated_conjecture, ~moref @ (pf @ x @ z) @ (pf @ y @ u), inference(split_conjunct,[status(thm)],[c_0_30])).
0.21/0.46	thf(c_0_34, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(moref @ (pf @ X1 @ X2) @ (pf @ X3 @ X4)|~moref @ X1 @ X3|~moref @ X2 @ X4), inference(spm,[status(thm)],[c_0_31, c_0_32])).
0.21/0.46	thf(c_0_35, plain, moref @ x @ y, inference(split_conjunct,[status(thm)],[m])).
0.21/0.46	thf(c_0_36, plain, moref @ z @ u, inference(split_conjunct,[status(thm)],[n])).
0.21/0.46	thf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35]), c_0_36])]), ['proof']).
0.21/0.46	# SZS output end CNFRefutation
0.21/0.46	# Proof object total steps             : 38
0.21/0.46	# Proof object clause steps            : 18
0.21/0.46	# Proof object formula steps           : 20
0.21/0.46	# Proof object conjectures             : 4
0.21/0.46	# Proof object clause conjectures      : 2
0.21/0.46	# Proof object formula conjectures     : 2
0.21/0.46	# Proof object initial clauses used    : 9
0.21/0.46	# Proof object initial formulas used   : 9
0.21/0.46	# Proof object generating inferences   : 9
0.21/0.46	# Proof object simplifying inferences  : 3
0.21/0.46	# Training examples: 0 positive, 0 negative
0.21/0.46	# Parsed axioms                        : 18
0.21/0.46	# Removed by relevancy pruning/SinE    : 0
0.21/0.46	# Initial clauses                      : 18
0.21/0.46	# Removed in clause preprocessing      : 9
0.21/0.46	# Initial clauses in saturation        : 9
0.21/0.46	# Processed clauses                    : 479
0.21/0.46	# ...of these trivial                  : 0
0.21/0.46	# ...subsumed                          : 180
0.21/0.46	# ...remaining for further processing  : 299
0.21/0.46	# Other redundant clauses eliminated   : 0
0.21/0.46	# Clauses deleted for lack of memory   : 0
0.21/0.47	# Backward-subsumed                    : 0
0.21/0.47	# Backward-rewritten                   : 0
0.21/0.47	# Generated clauses                    : 2460
0.21/0.47	# ...of the previous two non-trivial   : 2458
0.21/0.47	# Contextual simplify-reflections      : 0
0.21/0.47	# Paramodulations                      : 2460
0.21/0.47	# Factorizations                       : 0
0.21/0.47	# NegExts                              : 0
0.21/0.47	# Equation resolutions                 : 0
0.21/0.47	# Propositional unsat checks           : 0
0.21/0.47	#    Propositional check models        : 0
0.21/0.47	#    Propositional check unsatisfiable : 0
0.21/0.47	#    Propositional clauses             : 0
0.21/0.47	#    Propositional clauses after purity: 0
0.21/0.47	#    Propositional unsat core size     : 0
0.21/0.47	#    Propositional preprocessing time  : 0.000
0.21/0.47	#    Propositional encoding time       : 0.000
0.21/0.47	#    Propositional solver time         : 0.000
0.21/0.47	#    Success case prop preproc time    : 0.000
0.21/0.47	#    Success case prop encoding time   : 0.000
0.21/0.47	#    Success case prop solver time     : 0.000
0.21/0.47	# Current number of processed clauses  : 290
0.21/0.47	#    Positive orientable unit clauses  : 3
0.21/0.47	#    Positive unorientable unit clauses: 0
0.21/0.47	#    Negative unit clauses             : 3
0.21/0.47	#    Non-unit-clauses                  : 284
0.21/0.47	# Current number of unprocessed clauses: 1946
0.21/0.47	# ...number of literals in the above   : 9087
0.21/0.47	# Current number of archived formulas  : 0
0.21/0.47	# Current number of archived clauses   : 9
0.21/0.47	# Clause-clause subsumption calls (NU) : 17177
0.21/0.47	# Rec. Clause-clause subsumption calls : 12151
0.21/0.47	# Non-unit clause-clause subsumptions  : 180
0.21/0.47	# Unit Clause-clause subsumption calls : 360
0.21/0.47	# Rewrite failures with RHS unbound    : 0
0.21/0.47	# BW rewrite match attempts            : 0
0.21/0.47	# BW rewrite match successes           : 0
0.21/0.47	# Condensation attempts                : 0
0.21/0.47	# Condensation successes               : 0
0.21/0.47	# Termbank termtop insertions          : 41078
0.21/0.47	
0.21/0.47	# -------------------------------------------------
0.21/0.47	# User time                : 0.092 s
0.21/0.47	# System time              : 0.003 s
0.21/0.47	# Total time               : 0.095 s
0.21/0.47	# Maximum resident set size: 1648 pages
0.21/0.47	EOF